Dependent choice, ‘quote’ and the clock
نویسندگان
چکیده
منابع مشابه
Dependent choice, 'quote' and the clock
When using the Curry-Howard correspondence in order to obtain executable programs from mathematical proofs, we are faced with a difficult problem : to interpret each axiom of our axiom system for mathematics (which may be, for example, second order classical logic, or classical set theory) as an instruction of our programming language. This problem has been solved for the axiom of excluded midd...
متن کاملAxiomatizing the Quote
We study reflection in the Lambda Calculus from an axiomatic point of view. Specifically, we consider various properties that the quote p·q must satisfy as a function from Λ to Λ. The most important of these is the existence of a definable left inverse: a term E, called the evaluator for p·q, that satisfies EpMq = M for all M ∈ Λ. Usually the quote pMq encodes the syntax of a given term, and th...
متن کاملDOUBLETIME plays a noncatalytic role to mediate CLOCK phosphorylation and repress CLOCK-dependent transcription within the Drosophila circadian clock.
Circadian clocks keep time via gene expression feedback loops that are controlled by time-of-day-specific changes in the synthesis, activity, and degradation of transcription factors. Within the Drosophila melanogaster circadian clock, DOUBLETIME (DBT) kinase is necessary for the phosphorylation of PERIOD (PER), a transcriptional repressor, and CLOCK (CLK), a transcriptional activator, as CLK-d...
متن کاملState dependent choice
We propose a theory of choices that are influenced by the psychological state of the agent. The central hypothesis is that the psychological state controls the urgency of the attributes sought by the decision maker in the available alternatives. While state dependent choice is less restricted than rational choice, our model does have empirical content, expressed by simple ‘revealed preference’ ...
متن کامل6 - Dependent Random Choice
If F is a family of graphs containing a bipartite graph, then for some δ > 0, ex(n,F) < n2−δ by the Kövari-Sós-Turán Theorem. Erdős and Simonovits [5] conjectured that for every finite family graph F of graphs, there exists α = α(F) such that ex(n,F) = Θ(nα). This α is called the exponent of F . If F is a bipartite graph containing a cycle, then in general it is not known if F = {F} has an expo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00776-4